Efficient solutions to bargaining problems with uncertain disagreement points
نویسندگان
چکیده
We consider a cooperative model of bargaining where the location of the disagreement point may be uncertain. Based on the maximin criterion, we formulate an ex ante efficiency condition and characterize the class of bargaining solutions satisfying this axiom. These solutions are generalizations of the monotone path solutions. Adding individual rationality yields a subclass of these solutions. By employing maximin efficiency and an invariance property that implies individual rationality, a new axiomatization of the monotone path solutions is obtained. Furthermore, we show that an efficiency axiom employing the maximax criterion leads to an impossibility result. Journal of Economic Literature Classification No.: C78. ∗ Financial support from the Nederlandse Organisatie voor Wetenschappelijk Onderzoek (NWO) under grant no. B46-363 and from the University of Nottingham is gratefully acknowledged.
منابع مشابه
Relative Disagreement-Point Monotonicity of Bargaining Solutions
Prominent bargaining solutions are disagreement-point monotonic. These solutions’ disagreement-point monotonicity ranking, on the other hand, is impossible to establish. In a large class of bargaining problems, however, a ranking of the relative disagreement-point monotonicity of these prominent bargaining solutions can be obtained. Using the ‘Constant Elasticity of Substitution’ class of barga...
متن کاملA Tale of Two Bargaining Solutions
We set up a rich bilateral bargaining model with four salient points (disagreement point, ideal point, reference point, and tempered aspirations point), where the disagreement point and the utility possibilities frontier are endogenously determined. This model allows us to compare two bargaining solutions that use reference points, the Gupta-Livne solution and the tempered aspirations solution,...
متن کاملInterim Outcomes and Bargaining Solutions
In this paper, we employ a uni ed approach to Nashs two-person bargaining problem by using a class of axioms, which we term Common Disagreement Point (CDP) axioms. These axioms describe under what circumstances parties that expect to face sometimes uncertain nested or non-nested bargaining sets can reach interim outcomes. By doing so, these axioms portray a bargaining process, and thereby brid...
متن کاملOn the consistency of data with bargaining theories
We develop observable restrictions of well-known theories of bargaining over money. We suppose that we observe a finite data set of bargaining outcomes, including data on allocations and disagreement points, but no information on utility functions. We ask when a given theory could generate the data. We show that if the disagreement point is fixed and symmetric, the Nash, utilitarian, and egalit...
متن کاملSubmodularity Helps in Nash and Nonsymmetric Bargaining
Motivated by recent insights on the two solution concepts of Nash and nonsymmetric bargaining games, obtained from an algorithmic study of these notions [Vaz09], we take a fresh look at understanding their quality and robustness by subjecting them to several “stress tests”. Our tests are quite basic, e.g., we ask whether the solutions delivered are efficient, fair, respond in a desirable manner...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Social Choice and Welfare
دوره 19 شماره
صفحات -
تاریخ انتشار 2002